From Resolution and DPLL to Solving Arithmetic Constraints
Identifieur interne : 001580 ( Main/Exploration ); précédent : 001579; suivant : 001581From Resolution and DPLL to Solving Arithmetic Constraints
Auteurs : Konstantin Korovin [Royaume-Uni]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Reasoning methods based on resolution and DPLL have enjoyed many success stories in real-life applications. One of the challenges is whether we can go beyond and extend this technology to other domains such as arithmetic. In our recent work we introduced two methods for solving systems of linear inequalities called conflict resolution (CR) [6,7] and bound propagation (BP) [3,8] which aim to address this challenge. In particular, conflict resolution can be seen as a refinement of resolution and bound propagation is analogous to DPLL with constraint propagation, backjumping and lemma learning. There are non-trivial issues when considering arithmetic constraints such as termination, dynamic variable ordering and dealing with large coefficients. In this talk I will overview our approach and some related work [1,2,4,5,9]. This is a joint work with Ioan Dragan, Laura Kovács, Nestan Tsiskaridze and Andrei Voronkov.
Url:
DOI: 10.1007/978-3-642-40885-4_18
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002121
- to stream Istex, to step Curation: 002093
- to stream Istex, to step Checkpoint: 000206
- to stream Main, to step Merge: 001592
- to stream Main, to step Curation: 001580
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">From Resolution and DPLL to Solving Arithmetic Constraints</title><author><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8F25D0CC4F790F358649B57EF93A8D69F89DFE6D</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_18</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-11LSWB1S-G/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002121</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002121</idno><idno type="wicri:Area/Istex/Curation">002093</idno><idno type="wicri:Area/Istex/Checkpoint">000206</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000206</idno><idno type="wicri:doubleKey">0302-9743:2013:Korovin K:from:resolution:and</idno><idno type="wicri:Area/Main/Merge">001592</idno><idno type="wicri:Area/Main/Curation">001580</idno><idno type="wicri:Area/Main/Exploration">001580</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">From Resolution and DPLL to Solving Arithmetic Constraints</title><author><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name><affiliation wicri:level="4"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>School of Computer Science, The University of Manchester</wicri:regionArea><placeName><settlement type="city">Manchester</settlement><region type="nation">Angleterre</region><region nuts="2" type="region">Grand Manchester</region></placeName><orgName type="university">Université de Manchester</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Reasoning methods based on resolution and DPLL have enjoyed many success stories in real-life applications. One of the challenges is whether we can go beyond and extend this technology to other domains such as arithmetic. In our recent work we introduced two methods for solving systems of linear inequalities called conflict resolution (CR) [6,7] and bound propagation (BP) [3,8] which aim to address this challenge. In particular, conflict resolution can be seen as a refinement of resolution and bound propagation is analogous to DPLL with constraint propagation, backjumping and lemma learning. There are non-trivial issues when considering arithmetic constraints such as termination, dynamic variable ordering and dealing with large coefficients. In this talk I will overview our approach and some related work [1,2,4,5,9]. This is a joint work with Ioan Dragan, Laura Kovács, Nestan Tsiskaridze and Andrei Voronkov.</div></front></TEI><affiliations><list><country><li>Royaume-Uni</li></country><region><li>Angleterre</li><li>Grand Manchester</li></region><settlement><li>Manchester</li></settlement><orgName><li>Université de Manchester</li></orgName></list><tree><country name="Royaume-Uni"><region name="Angleterre"><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></region><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001580 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001580 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:8F25D0CC4F790F358649B57EF93A8D69F89DFE6D
|texte= From Resolution and DPLL to Solving Arithmetic Constraints
}}
| This area was generated with Dilib version V0.6.33. |  |